Proactive Project Scheduling with a Bi-Objective Genetic Algorithm in an R&D Department

نویسندگان

  • Canan Capa
  • Gunduz Ulusoy
چکیده

During project execution, especially in a multi-project environment unforeseen events arise that disrupt project plans resulting in deviations of project plans and budgets due to missed due dates and deadlines, resource idleness, higher work-in-process inventory and increased system nervousness. Therefore, project schedules should also include solution robustness to cope with the uncertainties such that actually realized activity start times during project execution will not differ much from the baseline schedule. Constructing solution robust schedules requires proactive scheduling techniques. The literature on proactive project scheduling is relatively scarce. Leus (2003) consider the objective of minimizing the total weighted instability of the schedules from a given deadline. Herroelen and Leus (2004) develop mathematical models for the generation of stable baseline schedules. Van de Vonder et. al. (2006) propose resource flow dependent float factor heuristic as a time buffering technique relying completely on the activity weights. Lambrechts et. al. (2008) focus on disruptions caused by stochastic resource availabilities to generate stable baseline schedules. Van de Vonder et. al. (2008) introduce multiple algorithms to include time buffers in a given schedule while a predefined project due date remains respected. In a recent study, Lambrechts et. al. (2011) analytically determine the impact of unexpected resource breakdowns on activity durations and develop an approach for inserting explicit idle time into project schedules in order to protect them from possible resource unavailability. In addition to these proactive strategies, there are some risk integrated procedures. Shatteman et. al. (2008) develop a computer supported risk management system that allows to identify, analyze and quantify the major risk factors and derive the probability of their occurrence and their impact on the duration of the project activities. Creemers et. al. (2011) propose a quantitative approach that allows to address the risk response process in a scientifically-sound manner and shows that a risk-driven approach is more efficient than an activity-based approach when it comes to analyzing risks. Herroelen (2014) propose a methodology that integrates quantitative risk analysis with reliable proactive/reactive project scheduling procedures. We consider the preemptive resource constrained multi-project scheduling problem (RCMPSP) with generalized precedence relations in a stochastic and dynamic environment and develop a three-phase model incorporating data mining and project scheduling techniques to schedule the projects in the R&D Department of a leading home appliances company in Turkey. Phase I of the model, uncertainty assessment phase, provides a systematic approach to assess uncertainty by identifying the most important sources of uncertainty, measuring the impacts of these factors to resource usage deviation levels of projects and their activities and generating activity deviation distributions by using the most important data mining techniques: feature subset selection, clustering and classification. Phase II, proactive project scheduling phase, proposes two scheduling approaches using a bi-objective genetic algorithm (GA). Phase III, reactive project scheduling phase, aims at rescheduling the disrupted project activities. In this paper, our focus is limited to Phase II of the three-phase approach. In Section 2, the problem and the problem environment are explained. In Section 3, we present the solution methodology and in Section 4 we present the main results obtained by the implementation of the proposed proactive project scheduling approach with real data. Finally, in Section 5 we conclude and provide suggestions for future work.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bi-objective Pre-emption Multi-mode Resource Constrained Project Scheduling Problem with due Dates in the Activities

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...

متن کامل

Proactive Project Scheduling in an R&D Department

In this paper, we present part of a study on stochastic, dynamic project scheduling in an R&D Department of a leading home appliances company in Turkey. The problem under consideration is the preemptive resource constrained multi-project scheduling problem with generalized precedence relations in a stochastic and dynamic environment. The model consists of three phases. Phase I of the model prov...

متن کامل

Optimizing a bi-objective preemptive multi-mode resource constrained project scheduling problem: NSGA-II and MOICA algorithms

The aim of a multi-mode resource-constrained project scheduling problem (MRCPSP) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). These goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

متن کامل

An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

متن کامل

A HYBRID GENETIC ALGORITHM FOR A BI-OBJECTIVE SCHEDULING PROBLEM IN A FLEXIBLE MANUFACTURING CELL

 This paper considers a bi-objective scheduling problem in a flexible manufacturing cell (FMC) which minimizes the maximum completion time (i.e., makespan) and maximum tardiness simultaneously. A new mathematical model is considered to reflect all aspect of the manufacturing cell. This type of scheduling problem is known to be NP-hard. To cope with the complexity of such a hard problem, a genet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014